Low-Congestion shortcuts without embedding
نویسندگان
چکیده
منابع مشابه
Enriching activity theory without shortcuts
Attempts to identify an intermediate unit between collective activity and individual action within activity theory are useful and necessary. While several possible conceptualizations have been put forward, engagement is a relevant candidate for naming such a unit. However, the elaboration of such a unit opens up difficult theoretical questions which should not be overlooked. To avoid shortcuts ...
متن کاملDistributed Algorithms for Planar Networks II: Low-Congestion Shortcuts, MST, and Min-Cut
This paper introduces the concept of low-congestion shortcuts for (near-)planar networks, and demonstrates their power by using them to obtain near-optimal distributed algorithms for problems such as Minimum Spanning Tree (MST) or Minimum Cut, in planar networks. Consider a graph G = (V,E) and a partitioning of V into subsets of nodes S1, . . . , SN , each inducing a connected subgraph G[Si]. W...
متن کاملSmall congestion embedding of graphs into hypercubes
We consider the problem of embedding graphs into hypercubes with minimal congestion. Kim and Lai showed that for a given N-vertex graph G and a hypercube it is NP-complete to determine whether G is embeddable in the hypercube with unit congestion, but G can be embedded with unit congestion in a hypercube of dimension 6log N if the maximum degree of a vertex in G is no more than 6log N . Bha...
متن کاملEmbedding shapes without predefined parts
For a practical computer implementation of part embedding in shapes that is also true to their continuous character and the shape grammar formalism, shapes and their boundaries are handled together in composite shape and label algebras. Temporary representations of shapes, termed `overcomplete graphs', comprise boundary elements of shapes and how they are assembled, and are utilized in a two-ph...
متن کاملEmbedding Languages without Breaking Tools
Domain-specific languages (DSLs) are increasingly used as embedded languages within general-purpose host languages. DSLs provide a compact, dedicated syntax for specifying parts of an application related to specialized domains. Unfortunately, such language extensions typically do not integrate well with the development tools of the host language. Editors, compilers and debuggers are either unaw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Distributed Computing
سال: 2020
ISSN: 0178-2770,1432-0452
DOI: 10.1007/s00446-020-00383-2